Depth-bounded Belief functions
نویسندگان
چکیده
منابع مشابه
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions
Let ~:= {f~,f2 . . . . } be a family of symmetric Boolean functions, where fn has n Boolean variables, for each n I> 1. L e t / ~ ( n ) be the minimum number of variables offn that each have to be set to constant values so that the resulting function is a constant function. We show that the growth rate o f / ~ ( n ) completely determines whether or not the family ~: is 'good', that is, can be r...
متن کاملResource Bounded Belief Revision
The AGM paradigm for belief revision provides a very elegant and powerful framework to reason about idealized agents. The paradigm assumes that the modelled agent is a perfect reasoner with innnite memory. In this paper we propose a framework to reason about non-ideal agents that generalizes the AGM paradigm. We rst introduce a structure to represent an agent's belief states that distinguishes ...
متن کاملBelief and Bounded Rationality
Since Quine’s Word and Object [Qui60], there has been more-or-less general agreement on the correct treatment on the status of talk about intentional attitudes. In a strict ontological sense, “the canonical scheme for us is the austere scheme” according to which there are “no propositional attitudes but only the physical constitution and behaviour of organisms” [Qui60, p. 221]. However, intenti...
متن کاملDepth-bounded Discrepancy Search
Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have been proposed for improving the chance of f inding a goal in a l imi ted amount of search. Depth-bounded discrepancy search offers such a hope. The motivat ion behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top o...
متن کاملDepth - bounded Discrepancy
Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of nding a goal in a limited amount of search. Depth-bounded discrepancy search ooers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2020
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2020.05.001